A formalization of Java’s concurrent access modes
نویسندگان
چکیده
منابع مشابه
A Formalization of a Concurrent Object Calculus up to -conversion
We experiment a method for representing a concurrent object calculus in the Calculus of Inductive Constructions. Terms are rst deened in de Bruijn style, then names are reintroduced in binders. The terms of the calculus are formalized in the mechanized logic by suitable subsets of the de Bruijn terms; namely those whose de Bruijn indices are relayed beyond the scene. The-equivalence relation is...
متن کاملA Modular Formalization of Reversibility for Concurrent Models and Languages
Causal-consistent reversibility is the reference notion of reversibility for concurrency. We introduce a modular framework for defining causal-consistent reversible extensions of concurrent models and languages. We show how our framework can be used to define reversible extensions of formalisms as different as CCS and concurrent X-machines. The generality of the approach allows for the reuse of...
متن کاملLogical Formalization of Concurrent Actions for Multi-Agent Systems
This paper presents a logical approach to formalization of some aspects of multi-agent systems in an incompletely known world. The contribution on this regard is as follows. We formalized reasoning about concurrent actions inside the situation calculus framework which has the suuciently clear and well-understood semantics to express diierent aspects of agent theory. Conclusions can be drawn by ...
متن کاملFormalization of UML Statechart Models Using Concurrent Regular Expressions
The Unified Modeling Language (UML) is widely used in the software development process for specification of system based on the object-oriented paradigm. Thought the current version of UML is semi-formal, it is difficult to determine whether the model is consistent, unambiguous, or complete. This paper proposes the transformation rules for formalizing UML statechart diagrams. The target languag...
متن کاملConcurrent Access of Priority Queues
The heap is an important data structure used as a priority queue in a wide variety of parallel algorithms (e.g., multiprocessor scheduling, branch-and-bound). In these algorithms, contention for the shared heap limits the obtainable speedup. This paper presents an approach to allow concurrent insertions and deletions on the heap in a shared-memory multiprocessor. The scheme also retains the str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2019
ISSN: 2475-1421
DOI: 10.1145/3360568